Enumeration of finite automata
نویسندگان
چکیده
منابع مشابه
Enumeration and Generation of Initially Connected Deterministic Finite Automata
The representation of combinatorial objects is decisive for the feasibility of several enumerative tasks. In this work, we present a (unique) string representation for (complete) initially-connected deterministic automata (ICDFA’s) with n states over an alphabet of k symbols. For these strings we give a regular expression and show how they are adequate for exact and random generation, allow an ...
متن کاملAsymptotic enumeration of Minimal Automata
We determine the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over the possible transition structures, and a binomial distribution over terminal states, with arbitrary parameter b. It turns out that a fraction ∼ 1 − C(k, b)n of automata is minimal, with C(k, b) a function, explicitly ...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملA Generalization of the Genocchi Numbers with Applications to Enumeration of Finite Automata
We consider a natural generalization of the well studied Genocchi numbers This generalization proves useful in enumerating the class of deterministic nite automata DFA which accept a nite language We also link our generalization to the method of Gandhi polynomials for generating Genocchi numbers Introduction and Motivation The study of Genocchi numbers and their combinatorial interpretations ha...
متن کاملExact enumeration of acyclic deterministic automata
A linear recurrence relation is derived for the number of unlabelled initially connected acyclic automata. The coefficients of this relation are determined by another, alternating, recurrence relation. The latter determines, in particular, the number of acyclic automata with labelled states. Certain simple enumerative techniques developed by the author for counting initially connected automata ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1967
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(67)91186-2